Logic Column 12: Logical Verification and Equational Verification
نویسنده
چکیده
Note from the Editor: There were some errors in the last article of the Logic Column. Thanks to Claudia Zepeda for spotting them. They have been corrected in the online version of the article, available from the CORR archive at http://arxiv.org/abs/cs.LO/0502031. All articles published in this column are archived at CORR; the following URL will return them all: http: //arxiv.org/find/grp_cs/1/ti:+AND+logic+column. I am always looking for contributions. If you have any suggestion concerning the content of the Logic Column, or even better, if you would like to contribute by writing a survey or tutorial on your own work or topic related to your area of interest, feel free to get in touch with me.
منابع مشابه
Verification of CRWL Programs with Rewriting Logic
We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-deterministic and partial functions. Our approach transforms functionallogic programs into Maude theories and then uses the Rewriting Logic logical framework to verify properties of the transformed programs. We propose an induc...
متن کاملApplications of Unskolemization
This dissertation describes a novel method for deriving logical consequences of first-order formulas using resolution and unskolemization. A complete unskolemization algorithm is given and its properties analyzed. This method is then applied to a number of different fields, namely program verification, machine learning, and mathematical induction. The foremost problem in automating program veri...
متن کاملAutomatic verification of epistemic specifications under convergent equational theories
We present a methodology for the automatic verification of multi-agent systems against temporal-epistemic specifications derived from higher-level languages defined over convergent equational theories. We introduce a modality called rewriting knowledge that operates on local equalities. We discuss the conditions under which its interpretation can be approximated by a second modality that we int...
متن کاملQuasi-boolean encodings and conditionals in algebraic specification
We develop a general study of the algebraic specification practice, originating from the OBJ tradition, which encodes atomic sentences in logical specification languages as Boolean terms. This practice originally motivated by operational aspects, but also leading to significant increase in expressivity power, has recently become important within the context of some formal verification methodolo...
متن کاملPrinciples for Verification Tools: Separation Logic
A principled approach to the design of program verification and construction tools is applied to separation logic. The control flow is modelled by power series with convolution as separating conjunction. A generic construction lifts resource monoids to assertion and predicate transformer quantales. The data flow is captured by concrete store/heap models. These are linked to the separation algeb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0505024 شماره
صفحات -
تاریخ انتشار 2005